symbolic convolution

См. также в других словарях:

• Symbolic combinatorics — in mathematics is a technique of analytic combinatorics that uses symbolic representations of combinatorial classes to derive their generating functions. The underlying mathematics, including the Pólya enumeration theorem, are explained on the… …   Wikipedia

• Distribution (mathematics) — This article is about generalized functions in mathematical analysis. For the probability meaning, see Probability distribution. For other uses, see Distribution (disambiguation). In mathematical analysis, distributions (or generalized functions) …   Wikipedia

• Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… …   Wikipedia

• Schönhage-Strassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… …   Wikipedia

• List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

• Stirling numbers and exponential generating functions — The use of exponential generating functions or EGFs to study the properties of Stirling numbers is a classical exercise in combinatorics and possibly the canonical example of how symbolic combinatorics, the method that encapsulates the… …   Wikipedia

• Integral — This article is about the concept of integrals in calculus. For the set of numbers, see integer. For other uses, see Integral (disambiguation). A definite integral of a function can be represented as the signed area of the region bounded by its… …   Wikipedia

• Generalized function — In mathematics, generalized functions are objects generalizing the notion of functions. There is more than one recognised theory. Generalized functions are especially useful in making discontinuous functions more like smooth functions, and (going …   Wikipedia

• Sum of normally distributed random variables — In probability theory, if X and Y are independent random variables that are normally distributed, then X + Y is also normally distributed; i.e. if :X sim N(mu, sigma^2),and :Y sim N( u, au^2),and X and Y are independent, then:Z = X + Y sim N(mu + …   Wikipedia

• Addition — is the mathematical process of putting things together. The plus sign + means that two numbers are added together. For example, in the picture on the right, there are 3 + 2 apples meaning three apples and two other apples which is the same as… …   Wikipedia

• Neural network — For other uses, see Neural network (disambiguation). Simplified view of a feedforward artificial neural network The term neural network was traditionally used to refer to a network or circuit of biological neurons.[1] The modern usage of the term …   Wikipedia